Tiling with Squares and Square-tileable Surfaces

نویسنده

  • Richard Kenyon
چکیده

We introduce thèsquare tiling group' and use it to give necessary conditions on a planar polygon to be tileable with squares. We deene square tilings on Riemann surfaces, and compute the Euclidean structures on a torus which are square-tileable. We give necessary conditions on surfaces of higher genus to be tileable. A higher-dimensional version of the square-tiling group yields necessary conditions on an n-dimensional rectilinear polyhedron to be tileable by boxes, each having k rational relations among its side lengths. We deene the rectilinear scissors congruence problem for R n related to box tilings and construct a complete invariant.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spaces of Domino Tilings

We consider the set of all tilings by dominoes (2 1 rectangles) of a surface, possibly with boundary, consisting of unit squares. Convert this set into a graph by joining two tilings by an edge if they diier by a ip, i.e., a 90 rotation of a pair of side-by-side dominoes. We give a criterion to decide if two tilings are in the same connected component, a simple formula for distances and a metho...

متن کامل

Lengths of Systoles on Tileable Hyperbolic Surfaces

The same triangle may tile geometrically distinct surfaces of the same genus, and these tilings may determine isomorphic tiling groups. We determine if there are geometric differences in the surfaces that can be found using group theoretic methods. Specifically, we determine if the systole, the shortest closed geodesic on a surface, can distinguish a certain families of tilings. For example, th...

متن کامل

Tiling a Rectangle with the Fewest Squares

We show that a square-tiling of a p × q rectangle, where p and q are relatively prime integers, has at least log2 p squares. If q > p we construct a square-tiling with less than q/p+C log p squares of integer size, for some universal constant C.

متن کامل

On the Tileability of Polygons with Colored Dominoes

We consider questions concerning the tileability of orthogonal polygons with colored dominoes. A colored domino is a rotatable 2× 1 rectangle that is partitioned into two unit squares, which are called faces, each of which is assigned a color. In a colored domino tiling of an orthogonal polygon P , a set of dominoes completely covers P such that no dominoes overlap and so that adjacent faces ha...

متن کامل

Automatic Tiling of “Mostly-Tileable” Loop Nests

Polyhedral compilation techniques have proven to be a powerful tool for optimization of dense array codes. In particular, their ability to tile imperfectly nested loops has provided dramatic speedups by countering limits of memory or network bandwidth. Unfortunately, certain codes, including RNA secondary-structure prediction codes, cannot be tiled effectively using the standard tiling algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007